Although narcissists often emerge as leaders, the relationship between leader narcissism and follower performance is ambiguous and often even found to be negative. For women, narcissism seems especially likely to lead to negative evaluations. Since narcissists have the tendency to be impulsive and change their minds on a whim, they may come across as inconsistent. We propose “inconsistent leader behavior” as a new mechanism in the relationship between leader narcissism and follower performance and argue that leader gender plays an important (...) role in whether narcissistic leaders are perceived as inconsistent. Specifically, we expect leader narcissism to have a negative relationship with follower performance through perceived inconsistent leader behavior, especially for female leaders. Thus, we examine leader gender as a personal factor moderating the relationship between narcissism and perceived inconsistent behavior. Also, as perceived inconsistency is likely less problematic when a good relationship exists, we examine leader–member exchange as a contextual condition moderating the relationship between leader behavior and follower performance. We test our moderated mediation model in a multi-source study with 165 unique leader–follower dyads. As expected, leader narcissism was positively related to perceived inconsistent leader behavior, and this relationship was stronger for female leaders. Inconsistent leader behavior was negatively related to follower performance, but only when LMX was low. Our research highlights that perceived behavioral inconsistency can be problematic and—for female leaders—provides an explanation of the negative relation of leader narcissism with follower performance and of the inconsistencies in evaluations of narcissistic leaders’ effectiveness. (shrink)

The paper presents a speculative model for associative memory. It has two layers: the lower layer describes memory of a single cell, the upper layer describes how the work is distributed address-free over a large set of cells. Thinking, consciousness and various features of memory are interpreted in terms of the memory model.

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal form A (...) at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem. (shrink)

The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension (...) to the Curry– Howard interpretation which draws on the idea of labelled deduction, and brings back Frege’s device of variable-abstraction to operate on the labels (i.e., proof-terms) alongside formulas of predicate logic. (shrink)

Semantic Automata Johan van Ben them. INTRODUCTION An attractive, but never very central idea in modern semantics has been to regard linguistic expressions ...

Looking at proof theory as an attempt to ‘code’ the general pattern of the logical steps of a mathematical proof, the question of what kind of rules can make the meaning of a logical connective completely explicit does not seem to have been answered satisfactorily. The lambda calculus seems to have been more coherent simply because the use of ‘λ’ together with its projection 'apply' is specified by what can be called a 'reduction' rule: β‐conversion. We attempt to analyse the (...) role of proof rules, making use of a set of formal rules designed to capture both the notions of proof theory and those of the lambda‐calculus: Martin‐Löf's Intuitionistic Type Theory. (shrink)

Dealing with soldier enhancement can be challenging for military physicians. As research on the ethics of soldier enhancement is mostly theoretical, this study aims to gain insights into the actual moral issues military physicians encounter, or expect to encounter. To that end, we carried out a qualitative study involving six focus groups of Dutch military physicians (n = 28) in operational roles. The participants voiced their concerns about moral issues concerning soldier enhancement. Based on the group discussions, and using inductive (...) thematic analysis, we ascertained three major themes: (1) Doing no harm in soldier enhancement: uncertainty and high stakes; (2) Dependency relationships and conflicting moral responsibilities; and (3) The risk of ethical slippery slopes. Our findings illustrate that dealing with these moral responsibilities requires considerable skill and acuity to weigh up for all the situated complexities and dependency relationships that go beyond abstract rules or moral principles. A care-ethical approach that acknowledges the contextual and relational aspects of moral complexities along with peer consultation and joint reflective dialogue on moral issues can help military physicians deal with soldier enhancement responsibly. (shrink)

Keine ausführliche Beschreibung für "Des Juden Philo Buch von der Weltschöpfung" verfügbar.

BackgroundClinical Ethics Support (CES) services are offered to support healthcare professionals in dealing with ethically difficult situations. Evaluation of CES is important to understand if it is indeed a supportive service in order to inform and improve future implementation of CES. Yet, methods to measure outcomes of CES are scarce. In 2014, the European Moral Case Deliberation Outcomes Instrument (Euro-MCD) was developed to measure outcomes of Moral Case Deliberation (MCD). To further validate the instrument, we tested it in field studies (...) and revised it. This paper presents the Euro-MCD 2.0 and describes the revision process.MethodsThe revision process comprised an iterative dialogue among the authors as Euro-MCD-project team, including empirical findings from six Euro-MCD field-studies and input from European experts in CES and theory. Empirical findings contained perceptions and experiences of MCD outcomes among healthcare professionals who participated in MCDs in various settings in Norway, Sweden and the Netherlands. Theoretical viewpoints on CES, literature on goals of CES and MCD and ethics theory guided the interpretation of the empirical findings and final selection of MCD outcomes.ResultsThe Euro-MCD 2.0 Instrument includes three domains: Moral Competence, Moral Teamwork and Moral Action. Moral Competence consists of items about moral sensitivity, analytical skills and virtuous attitude. Moral Teamwork includes open dialogue and supportive relationships and Moral Action refers to moral decision-making and responsible care. During the revision process, we made decisions about adding and reformulating items as well as decreasing the number from 26 to 15 items. We also altered the sentence structure of items to assess the current status of outcomes (e.g. ‘now’) instead of an assumed improvement over time (e.g. ‘better’) and we omitted the question about perceived importance.ConclusionsThe Euro-MCD 2.0 is shorter, less complex and more strongly substantiated by an integration of empirical findings, theoretical reflections and dialogues with participants and experts. Use of the Euro-MCD 2.0 will facilitate evaluation of MCD and can thereby monitor and foster implementation and quality of MCD. The Euro-MCD 2.0 will strengthen future research on evaluation of outcomes of MCD. (shrink)

As a celebration of theTractatus100th anniversary it might be worth revisiting its relation to the later writings. From the former to the latter, David Pears recalls that “everyone is aware of the holistic character of Wittgenstein’s later philosophy, but it is not so well known that it was already beginning to establish itself in theTractatus” (The False Prison, 1987). From the latter to the former, Stephen Hilmy’s (The Later Wittgenstein, 1987) extensive study of theNachlasshas helped removing classical misconceptions such as (...) Hintikka’s claim that “Wittgenstein in thePhilosophical Investigationsalmost completely gave up the calculus analogy.” Hilmy points out that even in theInvestigationsone finds the use of the calculus/game paradigm to the understanding of language, such as “in operating with the word” (Part I, §559) and “it plays a different part in the calculus”. Hilmy also quotes from a late (1946) unpublished manuscript (MS 130) “this sentence has use in the calculus of language”, which seems to be compatible with “asking whether and how a proposition can be verified is only a particular way of asking ‘How do you mean?’” Central in this back and forth there is an aspect which seems to deserve attention in the discussion of a semantics for the language of mathematics which might be based on (normalisation of) proofs and/or Hintikka/Lorenzen game-dialogue: the explication of consequences. Such a discussion is substantially supported by the use of the open and searchableThe Wittgenstein Archives at the University of Bergen. These findings are framed within the discussion of the meaning of logical constants in the context of natural deduction style rules of inference. (shrink)

One takes advantage of some basic properties of every homotopic \(\lambda\)-model (e.g. extensional Kan complex) to explore the higher \(\beta\eta\)-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher \(\lambda\)-terms, whose equality rules would be contained in the theory of any \(\lambda\)-homotopic model.

The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the application of a term/function to any other term/function, including itself. The calculus can be seen as a formal theory with certain pre-established axioms and inference rules, which can be interpreted by models. Dana Scott proposed the first non-trivial model of the extensional lambda calculus, (...) known as $ D_{\infty }$, to represent the $\lambda $-terms as the typical functions of set theory, where it is not allowed to apply a function to itself. Here we propose a construction of an $\infty $-groupoid from any lambda model endowed with a topology. We apply this construction for the particular case $D_{\infty }$, and we see that the Scott topology does not provide enough information about the relationship between higher homotopies. This motivates a new line of research focused on the exploration of $\lambda $-models with the structure of a non-trivial $\infty $-groupoid to generalize the proofs of term conversion to higher-proofs in $\lambda $-calculus. (shrink)